Convolutional wasserstein distances
نویسندگان
چکیده
منابع مشابه
Histogram Based Segmentation Using Wasserstein Distances
We developed variational models for image segmentation that incorporate histogram information into level set based curve evolution techniques. The novelty is in the use of Wasserstein mass transfer metrics in order to compare histograms; we found that this improves the results significantly over previous Left: Segmentation based on average intensities via ChanVese model. Right: Proposed model b...
متن کاملInference for Empirical Wasserstein Distances on Finite Spaces: Supplementary Material
Note that the constraints can only be satisfied if both √ λG − zr and √ 1− λH − zs have only non-negative entries and z ≤ 0. In this case the ∗Felix Bernstein Institute for Mathematical Statistics in the Biosciences and Institute for Mathematical Stochastics, University of Göttingen, Goldschmidtstraße 7, 37077 Göttingen †Max Planck Institute for Biophysical Chemistry, Am Faßberg 11, 37077 Götti...
متن کاملConformal Wasserstein Distances: Comparing Surfaces in Polynomial Time
We present a constructive approach to surface comparison realizable by a polynomial-time algorithm. We determine the “similarity” of two given surfaces by solving a mass-transportation problem between their conformal densities. This mass transportation problem differs from the standard case in that we require the solution to be invariant under global Möbius transformations. We present in detail...
متن کاملMinimax Statistical Learning and Domain Adaptation with Wasserstein Distances
As opposed to standard empirical risk minimization (ERM), distributionally robust optimization aims to minimize the worst-case risk over a larger ambiguity set containing the original empirical distribution of the training data. In this work, we describe a minimax framework for statistical learning with ambiguity sets given by balls in Wasserstein space. In particular, we prove a generalization...
متن کاملWoven convolutional graph codes with large free distances
Constructions of woven graph codes based on constituent convolutional codes are studied, and examples of woven convolutional graph codes are presented. Existence of codes satisfying the Costello lower bound on the free distance within a random ensemble of woven graph codes based on s-partite, s-uniform hypergraphs is shown, where s depends only on the code rate. Simulation results for Viterbi d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Graphics
سال: 2015
ISSN: 0730-0301,1557-7368
DOI: 10.1145/2766963